package binary;

public class Solution {
    //寻找峰顶元素
    public int findPeakElement(int[] nums) {
        int left = 0;
        int right = nums.length - 1;
        while(left < right) {
            int mid = left + (right - left + 1)/2;
            if(nums[mid] < nums[mid - 1]) {
                right = mid - 1;
            }else if (nums[mid] > nums[mid - 1]) {
                left = mid;
            }else{
                return mid;
            }
        }
        return left;
    }
}
